Estimating the size of search trees by sampling with domain knowledge
نویسندگان
چکیده
We show how recently-defined abstract models of the Branch & Bound algorithm can be used to obtain information on how the nodes are distributed in B&B search trees. This can be directly exploited in the form of probabilities in a sampling algorithm given by Knuth that estimates the size of a search tree. This method reduces the offline estimation error by a factor of two on search trees from MixedInteger Programming instances.
منابع مشابه
تعیین روش نمونه برداری مناسب جهت برآورد تراکم و سطح تاجپوشش درختان زوال یافته بلوط ایرانی (.Quercus brantii Lindl) در منطقه حفاظت شده دینارکوه ایلام
Oak decline as one of the most important environmental problems of Zagros forests, requires proper management to decrease trees dieback and mitigate its effects. This study aimed to find the best sampling method for estimating density and crown canopy of declined oak trees in Zagros Forests. All declined trees in an area of 100 ha of Dinarkooh protected forest were surveyed and trees density, g...
متن کاملStudy on the effect of forest stand distribution pattern on results of different estimators of the nearest individual distance method
The Nearest Individual Sampling Method is one of the distance sampling methods for estimating density, canopy cover and height of forest stands. Some distance sampling methods have more than one density estimator that may be skewed to the spatial pattern. Unless the stands of the trees under study have a random spatial pattern. Therefore, the purpose of this study was evaluating the effect of s...
متن کاملA Talent Management Model in Active Knowledge-Based Companies in Agricultural Domain of Guilan Province (Case Study: Rasht City)
The study aims at providing a model for talent management in active knowledge-based companies in agricultural domain of Guilan Province. This applied and descriptive study with a mixed research method. In the qualitative part, an in-depth semi-structured interview with 30 experts was used and also the theoretical foundations and research background study were applied for qualitative data collec...
متن کاملCounting by Statistics on Search Trees: Application to Constraint Satisfaction Problems
In 1975, D. Knuth proposed a simple statistical method for investigating search trees. We use this technique for estimating the number of solutions of CSP (Constraint Satisfaction Problem) and SAT (Boolean Satisfiability Problem) instances. We show that, depending on domain reductions, treebased estimates have a lower variance than estimates based on uniform sampling from the search space. Neve...
متن کاملQuery Architecture Expansion in Web Using Fuzzy Multi Domain Ontology
Due to the increasing web, there are many challenges to establish a general framework for data mining and retrieving structured data from the Web. Creating an ontology is a step towards solving this problem. The ontology raises the main entity and the concept of any data in data mining. In this paper, we tried to propose a method for applying the "meaning" of the search system, But the problem ...
متن کامل